A Distributed Planning Approach Using Multiagent Goal Transformations

نویسندگان

  • Michael T. Cox
  • Mohammad M. Elahi
  • Kevin Cleereman
چکیده

A multiagent goal transformation is defined as a directed alteration of goals by the agents in a multiagent system in order to adjust for lack of resources and/or lack of capabilities. Multiagent goal transformation can be used as a uniform coordination mechanism. We describe preliminary research that implements a distributed planning approach incorporating several co-operative planning agents and that uses a multiagent goal transformation as a coordination mechanism. Each agent in the system represents a domain with capabilities differing from the domains represented by the other agents. The distributed coordination mechanism allows distribution of tasks among agents and concatenation of resultant sub-plans from agents without a central coordination process. Examples are given to illustrate how the system works in the logistics transportation domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Scheduling Using Constraint Optimization and Multiagent Path Planning

The goal of the distributed scheduling problem is to minimize the global cost of assigning n decentralized workers to m tasks at time points. This problem is further complicated in continuous environments because the entire state space cannot be searched. This paper presents a decentralized approach of dividing the distributed scheduling in continuous environments problem into two subproblems: ...

متن کامل

Relaxation Heuristics for Multiagent Planning

Similarly to classical planning, in MA-STRIPS multiagent planning, heuristics significantly improve efficiency of search-based planners. Heuristics based on solving a relaxation of the original planning problem are intensively studied and well understood. In particular, frequently used is the delete relaxation, where all delete effects of actions are omitted. In this paper, we present a unified...

متن کامل

Admissible Landmark Heuristic for Multi-Agent Planning

Heuristics are a crucial component in modern planning systems. In optimal multiagent planning the state of the art is to compute the heuristic locally using only information available to a single agent. This approach has a major deficiency as the local shortest path can arbitrarily underestimate the true shortest path cost in the global problem. As a solution, we propose a distributed version o...

متن کامل

Synchronizing Multiagent Plans Using Temporal Logic Specifications

Plan synchronization is a method of analyzing multiagent plans to introduce ordering constraints between them so that heir concurrent xecution achieves a desired goal. We describe a plan synchronization method for goals expressed using temporal logic specifications. Our goals can involve both qualitative and quantitative time requirements. The requirements expressed by a goal can involve safety...

متن کامل

Multiagent Planning with Partially Ordered Temporal Plans

This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL allows to describe both qualitative and quantitative temporal relations among events, thus subsuming the temporal models of both PDDL 2.1 and POP. Other features are different levels of control over actions, modeling of agent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003